Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time
نویسنده
چکیده
A cactus is a simple data structure that represents all minimum cuts of a weighted, undi-rected graph in linear space. We describe the rst algorithm that can build a cactus from the asymptotically fastest deterministic algorithm that nds all minimum cuts in a weighted graph | the Hao-Orlin minimum cut algorithm. This improves the time to construct the cactus in graphs with n vertices and m edges from O(n 3) to O(nm log n 2 =m).
منابع مشابه
Finding Small Cuts and Building Their Cactus Representation Using Random Circulations (Partial Draft)
It is shown that the recent random circulation algorithm to find cut edges (bridges) and cut pairs can be parallelized optimally. Specifically, the parallel algorithm cam be made to run in O(log n) time using O(n + m) operations on the EREW PRAM model where n and m are the number of vertices and edges of the input graph respectively. A second contribution of this paper is an algorithm that runs...
متن کاملA near-linear time algorithm for constructing a cactus representation of minimum cuts
We present an Õ(m) (near-linear) time Monte Carlo algorithm for constructing the cactus data structure, a useful representation of all the global minimum edge cuts of an undirected graph. Our algorithm represents a fundamental improvement over the best previous (quadratic time) algorithms: because there can be quadratically many min-cuts, our algorithm must avoid looking at all min-cuts during ...
متن کاملHow to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus is transformed into a hierarchical clustering of the graph that contains complete information on all the minimum cuts. This approach is then extended to drawings in which the two vertex subsets of every minimum cut ar...
متن کاملHow to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus is transformed into a hierarchical clustering of the graph that contains complete information on all the minimum cuts. This approach is then extended to drawings in which the two vertex subsets of every minimum cut ar...
متن کاملCharacterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut is represented by a simple closed curve and vice versa. We show that the families of cuts that admit a drawing in which every cut is represented by an axis-parallel rectangle are exactly those that have a cactus model that can be rooted such that edges of the graph that cross a cycle of the cactus ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998